16 v 1 1 0 O ct 2 00 0 Towards Rule - Based Visual Programming of Generic Visual Systems ⋆ Berthold Hoffmann
نویسنده
چکیده
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computational model of graph transformation. The language supports object-oriented programming since its graphs are hierarchically structured. Typing allows the shape of these graphs to be specified recursively in order to increase program security. Thanks to its genericity, DIAPLAN allows to implement systems that represent and manipulate data in arbitrary diagram notations. The environment for the language exploits the diagram editor generator DIAGEN for providing genericity, and for implementing its user interface and type checker.
منابع مشابه
Towards Generic Rule-Based Visual Programming
This paper outlines DIAPLAN, a visual rule-based programming language and environment that is based on the computational model of graph transformation. Thanks to its genericity, DIAPLAN can generate visual environments with no restriction on their visual representation, and also supports object-oriented programming since its graphs are hierarchically structured.
متن کاملTowards rule-based visual programming of generic visual systems
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computational model of graph transformation. The language supports object-oriented programming since its graphs are hierarchically structured. Typing allows the shape of these graphs to be specified recursively in order to incre...
متن کامل1 O ct 2 00 7 On potentially K r + 1 − U - graphical Sequences
X iv :0 71 0. 04 09 v1 [ m at h. C O ] 1 O ct 2 00 7 On potentially Kr+1 − U -graphical Sequences Chunhui Lai, Guiying Yan 1 Department of Mathematics, Zhangzhou Teachers College, Zhangzhou, Fujian 363000, P. R. of CHINA. e-mail: [email protected] 2 Center of Graph Theory, Combinatorics and Network, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 10008...
متن کاملar X iv : c s . D M / 0 40 80 68 v 1 3 1 A ug 2 00 4 Probabilistic Analysis of Rule 2
Li and Wu proposed Rule 2, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. Here we study the asymptotic performance of Rule 2 on random unit disk graphs formed from n random points in an ln × ln square region of the plane. If ln = O( √ n/ logn), Rule 2 produces a dominating set whose expected size is O(n/(log logn)). keywords and phrases: c...
متن کاملar X iv : h ep - l at / 0 11 01 44 v 1 1 6 O ct 2 00 1 1 Re A 0 and Re A 2 from Quenched Lattice QCD
We have used domain wall fermions to calculate K → π and K → 0 matrix elements which can be used to study the ∆I = 1/2 rule for K decays in the Standard Model. Nonlinearities in the ∆I = 3/2 matrix elements due to chiral logarithms are explored and the subtractions needed for the ∆I = 1/2 matrix elements are discussed. Using renormalization factors calculated using non-perturbative renormalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006